lattice search
英 [ˈlætɪs sɜːtʃ]
美 [ˈlætɪs sɜːrtʃ]
格点搜索（寻优）法
双语例句
- Based on Rough Set Theory and Concept Lattice, a new method is proposed to search for association rules.
基于粗糙集和概念格，本文给出了一种挖掘关联规则的新算法。 - In the lattice HP model, confirmation of self-avoiding path is the key to search folding conformation.
在格子模型中，自回避路径的确定是搜索折叠构象的关键。 - Theoretical analysis and experiments show: comparing with a dimension lattice search, the searching for the parameter in Box Cox transformation by golden section search has less calculation, and it is easy to get more accurate result and is more applicable.
并从理论分析和实例检验两方面说明了与一维格点搜索法相比，使用黄金分割法确定Box-Cox变换中的参数计算量较小，容易使计算结果达到较高的精确度，且易用性也有所提高。 - On the basis of getting the lowest energy conformation of the lattice model with Monte Carlo method and genetic algorithm, we present a hybrid genetic algorithm search procedure suitable for use in protein folding simulations. The three methods are compared with computer simulation test.
在对模型问题采用Monte-Carlo方法和单纯遗传算法得到能量最小构象的基础上，提出了适用的混合遗传算法，并通过计算机模拟试验对三种方法作了比较。 - Finally, incremental algorithm of producing concept lattice is used to carry on concept clustering to the passage of search results, and produced the theme of each cluster result from it.
最后，使用增量式的概念格生成算法对搜索结果片段进行概念聚类，并从中产生每个聚类的主题。 - One realization method of Godin algorithm based on linked list structure is presented. Concept lattice node is organized as linked list structure, which helps to quickly search the child node by using indexed table. Accordingly, the time-efficiency of concept lattice incremental construction is improved.
给出了一种基于链表结构的Godin算法实现方法，该方法采用链表结构组织格结点，并利用索引表，实现了对概念格子结点的快速查找，提高了概念格渐进式构造的效率。 - After an analysis in this paper we know that, in a searching method, the lattice search is better than pure random search. And a crossover operator using the optimal point ( optimal point is a kind of lattice) is designed.
本文从理论上分析了在搜索技术中，用格点法比纯随机法好，并用格点理论（佳点是格点的一种）设计了遗传交叉算子。 - Association rule mining based on pruned concept lattice reduces the search space, and the efficiency of association rules mining algorithm is improved. 3.
两种构造算法各有特点和适用性。基于剪枝概念格挖掘关联规则，减少相应的搜索空间，提高关联规则挖掘的效率。 - Merge the results during the process of traversing the concept lattice. The merging result process can be viewed as an election process. Member search engine which participate in the search are voters and all the pages are candidates.
在遍历概念格的过程中实现结果聚合，把聚合过程看成是一个投票选举过程，参加查询的成员搜索引擎作为投票人，而每一个网页被看作是一个候选人。 - Firstly, the lattice is transformed into a structure similar to position special posterior lattice, in which only acoustic score is contained. Then the proposed method is used to search the best result.
该算法首先把词图变换为一种类似于位置确定的后验概率词图结构，这种结构中的弧只包含声学得分，然后采用该算法搜索出最优结果。 - At the second stage of the algorithm, an efficient heuristic algorithm called the dynamic lattice search method is used to optimize the positions of the surface atoms, further reducing the energy of the cluster.
在算法的后一阶段，一个动态格子搜索算法对团簇表面的原子进行优化，进一步降低了团簇的势能。 - In the previous literature, the dynamic lattice search method was applied to optimize Ag clusters, where a traditional definition for the energy of a single atom is adopted.
在先前的文献中，动态格子搜索算法被用于搜索Ag原子团簇的最低能量结构，其中单个原子的能量使用了传统的定义。